Fast Performance Prediction of Master-Slave Programs by Partial Task Execution

نویسندگان

  • Yasuharu Mizutani
  • Fumihiko Ino
  • Kenichi Hagihara
چکیده

In this paper, it is proposed to rapidly and accurately predict performance of master-slave (MS) parallel programs. To provide rapid prediction with high accuracy, our method reduces direct execution of the target MS program and estimates execution time of tasks of the program from only some directly executed tasks. In this estimation, we use a linear interpolation in order to reproduce the original order of task assignment, which affects the prediction accuracy of a performance saturation point. The experimental result shows that our proposed method predicts the performance of MS programs 1.7 times faster, at least, than the measured execution time which corresponds to the minimum time taken to predict the performance by prediction methods based on direct execution. Furthermore, our method predicts the performance with 7% error being as good as that of existing prediction method. Key-Words: Master-slave, Performance prediction, Parallel computational model, Simulation

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Master /

Master/Slave Speculative Parallelization (MSSP) is an execution paradigm for improving the execution rate of sequential programs by parallelizing them speculatively for execution on a multiprocessor. In MSSP, one processor—the master—executes an approximate version of the program to compute selected values that the full program’s execution is expected to compute. The master’s results are checke...

متن کامل

Master/slave Speculative Parallelization and Approximate Code

This dissertation describes Master/Slave Speculative Parallelization (MSSP), a novel execution paradigm to improve the execution rate of sequential programs by parallelizing them speculatively for execution on a multiprocessor. In MSSP, one processor—the master—executes an approximate copy of the program to compute values the program’s execution is expected to compute. The master’s results are ...

متن کامل

Master/Slave Speculative Parallelization with Distilled Programs

Speculative multithreading holds the potential to substantially improve the execution performance of sequential programs by leveraging the resources of multiple execution contexts (e.g., processors or threads). For unstructured non-numeric programs, the three key challenges of parallelization are (1) predicting the sequence of tasks (i.e., groups of instructions) that corresponds to the correct...

متن کامل

Designing Eecient Master-slave Parallel Genetic Algorithms Designing Eecient Master-slave Parallel Genetic Algorithms

A simple technique to reduce the execution time of genetic algorithms (GAs) is to divide the task of evaluating the population among several processors. This class of algorithms is called \global" parallel GAs because selection and mating consider the entire population. Global parallel GAs are usually implemented as master-slave programs and require constant interprocessor communication. This w...

متن کامل

Scheduling Divisible Workloads Using the Adaptive Time Factoring Algorithm

In the past years a vast amount of work has been done in order to improve the basic scheduling algorithms for master/slave computations. One of the main results from this is that the workload of the tasks may be adapted during the execution, using either a fixed increment or decrement (e.g. based on an arithmetical or geometrical ratio) or a more sophisticated function to adapt the workload. Cu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005